Speed Scaling with Multiple Servers under a Sum-Power Constraint
نویسندگان
چکیده
The problem of scheduling jobs and choosing their respective speeds with multiple servers under a sum-power constraint to minimize the flow time + energy is considered.
منابع مشابه
Non-preemptive Throughput Maximization for Speed-Scaling with Power-Down
We consider the problem of scheduling a set of n jobs on a single processor. Each job is characterized by its release date rj , its deadline dj and its processing volume pj . The processor can vary its speed and can switch into a sleep state in order to reduce its energy consumption. No energy is consumed in this state, but a fixed amount of energy, equal to L, is required for a transition from...
متن کاملSpeed Scaling with an Arbitrary Convex Power Function
All of the theoretical speed scaling research to date has assumed that the power function, which expresses the power consumption P as a function of the processor speed s, is of the form P = s, where α > 1 is some constant. Motivated in part by technological advances, we initiate a study of speed scaling with arbitrary convex power functions. We consider the problem of minimizing the total flow ...
متن کاملSpeed scaling with power down scheduling for agreeable deadlines
We consider the problem of scheduling on a single processor a given set of n jobs. Each job j has a workload wj and a release time rj . The processor can vary its speed and hibernate to reduce energy consumption. In a schedule minimizing overall consumed energy, it might be that some jobs complete arbitrarily far from their release time. So in order to guarantee some quality of service, we woul...
متن کاملSystems with multiple servers under heavy-tailed workloads
The heavy-tailed nature of Internet flow sizes, web pages and computer files can cause non-preemptive scheduling policies to have a large average response time. Since there are numerous communication and distributed processing systems where preempting jobs can be quite expensive, reducing response times under this constraint is a pressing issue. One proposal for tackling non-preemption is throu...
متن کاملAmplify-forward relaying for multiple antenna multiple relay networks under individual power constraint at each relay
This article considers the design of an optimal beamforming weight matrix of multiple-antenna multiple-relay networks. It is assumed that each relay utilizes the amplify and forward strategy, i.e., it multiplies the received signal vector by a matrix, dubbed the relay weight matrix, and forwards the resulting vector to the destination. Furthermore, we assume that the source and the destination ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Performance evaluation review
سال: 2022
ISSN: ['1557-9484', '0163-5999']
DOI: https://doi.org/10.1145/3529113.3529128